Classical-driving-assisted quantum speed-up
نویسندگان
چکیده
منابع مشابه
Quantum Computers Speed Up Classical with Probability Zero
Let f denote length preserving function on words. A classical algorithm can be considered as T iterated applications of black box representing f , beginning with input word x of length n. It is proved that if T = O(2 n 7+ε ), ε > 0, and f is chosen randomly then with probability 1 every quantum computer requires not less than T evaluations of f to obtain the result of classical computation. It ...
متن کاملQuantum Speed-up of Computations
1. The Physical Church-Turing Thesis. Physicists often interpret the Church-Turing Thesis as saying something about the scope and limitations of physical computing machines. Although this was not the intention of Church or Turing, the Physical Church Turing thesis is interesting in its own right. Consider, for example, Wolfram's formulation: One can expect in fact that universal computers are a...
متن کاملSpeed-up via Quantum Sampling
The Markov Chain Monte Carlo method is at the heart of most fully-polynomial randomized approximation schemes for #P-complete problems such as estimating the permanent or the value of a polytope. It is therefore very natural and important to determine whether quantum computers can speed-up classical mixing processes based on Markov chains. To this end, we present a new quantum algorithm, making...
متن کاملEnvironment-Assisted Speed-up of the Field Evolution in Cavity Quantum Electrodynamics.
We measure the quantum speed of the state evolution of the field in a weakly driven optical cavity QED system. To this end, the mode of the electromagnetic field is considered as a quantum system of interest with a preferential coupling to a tunable environment: the atoms. By controlling the environment, i.e., changing the number of atoms coupled to the optical cavity mode, an environment-assis...
متن کاملQuantum Speed-up for Approximating Partition Functions
We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method and use non-adaptive cooling schedules. The improvement in time complexity is twofold: a quadratic reduction with respect to the spectral gap of the underlying Markov chains and a quadratic reducti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2015
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.91.032112